Linear Programming Algorithms Using Least-Squares Method
نویسنده
چکیده
To my beloved wife, Yuijn iii ACKNOWLEDGEMENTS First, I want to thank my wife Yujin for her enduring patience and loving support during my study. She has been always there for me from the very beginning to this very end. She has been at the core of my motivation even when I was doubting if could finish this program. I also have to mention my beloved children, Lynn and Olivia, who have been an encouraging reminder that I have a job to complete. I appreciate my parents for the prayer they have done for me morning and night. Not only that, my father managed to continue his financial support even after he had to suffer all the financial loss from his business. It was more than a sacrificial love that the father could give to his son. Special thanks goes to my advisor, Dr. Ellis Johnson. No wonder he amazed me with his creative advice with the depth of his knowledge whenever I had to ask his help in my research. What inspired me most was his personality. His patience has sustained my research no matter how slow my research would seem to progress. He is the best teacher that I could have in my life. I would like to thank Dr. Earl Barnes and Dr. Sokol for reviewing the papers line by line for months, and giving me ideas and helpful advices. I would like to thank Dr. Tetali, who taught me two important math courses, which helped me very much. Dr. Savelsbergh's helpful suggestions made good improvement in the research. I want to express my appreciation to my office mate Kapil, who taught me many programming skills, and spent so much time for discussing my research. I would like to thank Aang, Ethan and Wut, who started Ph.D program with me, and shared and helped in many ways. I also want to express thanks to other ISYE friends for their help. I am indebted to many of the Korean friends in ISYE. Myunsuk and Hyunsuk helped me in many ways in my research. Chuljong helped me when my family had a hard time iv Finally and most importantly, I would like to give thanks to God, who was there with me in my difficult time, is with me, and will be with me. SUMMARY The simplex method is the most widely used algorithm for solving linear programming problems. …
منابع مشابه
Exact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملRecursive Algorithm for L1 Norm Estimation in Linear Models
L1 norm estimator has been widely used as a robust parameter estimation method for outlier detection. Different algorithms have been applied for L1 norm minimization among which the linear programming problem based on the simplex method is well known. In the present contribution, in order to solve an L1 norm minimization problem in a linear model, an interior point algorithm is developed which ...
متن کاملAn Effective Hybrid Artificial Bee Colony Algorithm for Nonnegative Linear Least Squares Problems
An effective hybrid artificial bee colony algorithm is proposed in this paper for nonnegative linear least squares problems. To further improve the performance of algorithm, orthogonal initialization method is employed to generate the initial swarm. Furthermore, to balance the exploration and exploitation abilities, a new search mechanism is designed. The performance of this algorithm is verifi...
متن کاملNon-Linear Continuum Regression Using Genetic Programming
In this contribution, genetic programming is combined with continuum regression to produce two novel non-linear continuum regression algorithms. The first is a ‘sequential’ algorithm while the second, adopts a ‘team-based’ strategy. Having discussed continuum regression, the modifications required to extend the algorithm for non-linear modelling are outlined. The results of applying the derived...
متن کاملStable Computation of Search Directions for Near-Degenerate Linear Programming Problems
In this paper, we examine stability issues that arise when computing the search directions (Ax, Ay, As) for a primal-dual path-following interior point method for linear programming. The dual step Ay can be obtained by solving a weighted least-squares problem for which the weight matrix becomes extremely ill conditioned near the boundary of the feasible region. Hough and Vavasis proposed using ...
متن کاملLeast Squares Policy Evaluation Algorithms with Linear Function Approximation1
We consider policy evaluation algorithms within the context of infinite-horizon dynamic programming problems with discounted cost. We focus on discrete-time dynamic systems with a large number of states, and we discuss two methods, which use simulation, temporal differences, and linear cost function approximation. The first method is a new gradient-like algorithm involving least-squares subprob...
متن کامل